MULTIDIMENSIONAL B-TREES FOR ASSOCIATIVE SEARCHING IN DATABASE SYSTEMSSCHEUERMANN P; OUKSEL M.1982; INFORMATION SYSTEMS; ISSN 0306-4379; GBR; DA. 1982; VOL. 7; NO 2; PP. 133-137; BIBL. 31 REF.Article

DETERMINING THE STABILITY MEMBER OF A GRAPH.CHVATAL V.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 643-662; BIBL. 20 REF.Article

LA CONSULTATION DICHOTOMIQUE UNIFORME A GAUCHESAILLARD JC.1980; R.A.I.R.O., INFORMAT.; FRA; DA. 1980; VOL. 14; NO 2; PP. 165-183; ABS. ENG; BIBL. 2 REF.Article

ARBRES BINAIRES DE RECHERCHE: PROPRIETES COMBINATOIRES ET APPLICATIONS.FRANCON J.1976; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT.; FR.; DA. 1976; VOL. 10; NO 12; PP. 35-50; BIBL. 15 REF.Article

TREE STRUCTURES FOR HIGH DIMENSIONALITY NEAREST NEIGHBOR SEARCHINGEASTMAN CM; WEISS SF.1982; INFORMATION SYSTEMS; ISSN 0306-4379; GBR; DA. 1982; VOL. 7; NO 2; PP. 115-122; BIBL. 20 REF.Article

SOME PROPERTIES OF TERNARY TREES.SZWARCFITER JL; WILSON LB.1978; COMPUTER J.; G.B.; DA. 1978; VOL. 21; NO 1; PP. 66-72; BIBL. 10 REF.Article

ON THE ANALYSIS OF ALGORITHMS FOR TREES.FRANCON J.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 2; PP. 155-169; BIBL. 9 REF.Article

ON THE MAX-ENTROPY RULE FOR A BINARY SEARCH TREEHORIBE Y; NEMETZ TOH.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 1; PP. 63-72; BIBL. 6 REF.Article

ON THE WEIGHTED PATH LENGTH OF BINARY SEARCH TREES FOR UNKNOWN ACCESS PROBABILITIESPISCHER T.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 284-291; BIBL. 10 REF.Conference Paper

A NEW ALGORITHM FOR MINIMUM COST BINARY TREES.GARSIA AM; WACHS ML.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 622-642; BIBL. 7 REF.Article

ASPECTS OF INSERTION IN RANDOM TREESBAGCHI A; REINGOLD EM.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 29; NO 1; PP. 11-29; ABS. GER; BIBL. 7 REF.Article

ON ALPHA -BALANCED BINARY SEARCH TREESOLIVIES HJ.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 98-108; BIBL. 5 REF.Conference Paper

BINARY SEARCH TREES: AVERAGE AND WORST CASE BEHAVIORGUETTLER R; MEMLHORN K; SCHNEIDER W et al.1980; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1980; VOL. 16; NO 1-3; PP. 41-61; ABS. GER/RUS; BIBL. 22 REF.Article

DYNAMIC WEIGHTED BINARY SEARCH TREESUNTERAUER K.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 4; PP. 341-362; BIBL. 15 REF.Article

ENGLISH DICTIONARY SEARCHING WITH LITTLE EXTRA SPACECOMER D.1979; NATIONAL COMPUTER CONFERENCE/1979/NEW YORK NY; USA; MONTVALE: AFIPS PRESS; DA. 1979; PP. 209-216; BIBL. 7 REF.Conference Paper

ON THE MEAN ACCURACY OF HIERARCHICAL CLASSIFIERSKULKARNI AV.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 8; PP. 771-776; BIBL. 9 REF.Article

SEQUENCE SEARCH TREES: THEIR ANALYSIS USING RECURRENCE RELATIONS.WILSON LB.1976; B.I.T.; DANM.; DA. 1976; VOL. 16; NO 3; PP. 332-337; BIBL. 6 REF.Article

AN ANALYSIS OF BINARY SEARCH TREES FORMED FROM SEQUENCES OF NONDISTINCT KEYS.BURGE WH.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 451-454; BIBL. 4 REF.Article

DATA STRUCTURES FOR RANGE SEARCHINGBENTLEY JL; FRIEDMAN JH.1979; COMPUTG SURV.; USA; DA. 1979; VOL. 11; NO 4; PP. 397-409; BIBL. 2 P.Article

DYNAMIC BINARY SEARCH TREESWRIGHT WE.1978; ACM 78. ASSOCIATION FOR COMPUTING MACHINERY. ANNUAL CONFERENCE/1978-12-4/WASHINGTON DC; USA; NEW YORK: THE ASSOCIATION FOR COMPUTING MACHINERY; DA. 1978; PP. 370-374; BIBL. 14 REF.Conference Paper

REBALANCING HEIGHT BALANCED TREESLUCCIO F; PAGLI L.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 5; PP. 386-396; BIBL. 5 REF.Article

A SELECTIVE TRAVERSAL ALGORITHM FOR BINARY SEARCH TREES.DRISCOLL JR; LIEN YE.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 6; PP. 445-447; BIBL. 5 REF.Article

CLIQUES OF A GRAPH. VARIATIONS ON THE BRON-KERBOSCH ALGORITHM.JOHNSTON HC.1976; INTERNATION. J. COMPUTER INFORM. SCI.; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 209-238; BIBL. 13 REF.Article

ZUGRIFFSGUENSTIGE DARSTELLUNG VON BINAERBAUMSTRUKTURIERTEN DATEIEN AUF PSEUDO-DIREKTZUGRIFFSSPEICHERN. = REPRESENTATION POUR OPTIMISER L'ACCES A DES DONNEES A STRUCTURE D'ARBRE BINAIRE, STOCKEES SUR DES MEMOIRES A ACCES PSEUDO-DIRECTSEEHUSEN J.1976; ANGEW. INFORMAT.; DTSCH.; DA. 1976; NO 8; PP. 337-342; ABS. ANGL.; BIBL. 7 REF.Article

ON A RELATIONSHIP BETWEEN 2-3 BROTHER TREES AND DENSE TERNARY TREESOLIVIE HJ.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 3; PP. 233-245; BIBL. 4 REF.Article